Pluggable checking and inferencing of nonnull types for Java.
نویسندگان
چکیده
منابع مشابه
Pluggable checking and inferencing of nonnull types for Java
We have implemented a non-null type checker for Java and a new non-null inferencing algorithm for analyzing legacy code. The tools are modular extensions to the JastAdd extensible Java compiler, illustrating how pluggable type systems can be achieved. The resulting implementation is compact, less than 230 lines of code for the non-null checker and 460 for the inferencer. Non-null checking is a ...
متن کاملJava Bytecode Verification for @NonNull Types
Java’s annotation mechanism allows us to extend its type system with non-null types. However, checking such types cannot be done using the existing bytecode verification algorithm. We extend this algorithm to verify non-null types using a novel technique that identifies aliasing relationships between local variables and stack locations in the JVM. We formalise this for a subset of Java Bytecode...
متن کاملPluggable Architecture for Java HPC Messaging
Efforts to build Java messaging systems based on the MPI standard have typically followed either the JNI approach or the pure Java approach. On commodity platforms like Fast Ethernet, advances in JVM (Java Virtual Machine) technology now enable networking applications written in Java to rival their C counterparts. On the other hand, improvements in specialized networking hardware have continued...
متن کاملGradual Pluggable Typing in Java
Gradual typing provides the ability to safely mix untyped or dynamically typed code with statically typed code while maintaining, within the statically typed portion, the guarantees claimed by the static typing. It is motivated by the idea that different amounts of typing are valuable at different times during a software projects development. Less typing is useful at the prototyping stage, wher...
متن کاملSelf-inferencing Reflection Resolution for Java
C o n si st en t * lete * W ll D o c u m e n t e d * E a s y t o R e u s e * * E v a l u a t e d * E C O O P * Ar tifact * A E C Reflection has always been an obstacle both for sound and for effective under-approximate pointer analysis for Java applications. In pointer analysis tools, reflection is either ignored or handled partially, resulting in missed, important behaviors. In this paper, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Object Technology
سال: 2007
ISSN: 1660-1769
DOI: 10.5381/jot.2007.6.9.a23